Parallel String Matching Algorithms based on Dataflow
نویسندگان
چکیده
This paper presents efficient dataflow schemes for parallel string matching. Two subproblems known as the exact matching and the k-mismatches problems are covered. Three parallel algorithms based on multiple input (and output) streams are presented. Time complexities of these parallel algorithms are O((n/d)+α), 0 ≤ α ≤ m, where n and m represent lengths of reference and pattern strings (n >> m) and d represents the number of streams used (the degree of parallelism). We can control the degree of parallelism by using variable number (d) of input (and output) streams. These performances are better than those found in the literature. These algorithms present three different methods to design special purpose systolic array hardware for string matching. With linear systolic array architecture, m PEs are needed for serial design and d*m PEs are needed for parallel design.
منابع مشابه
Nested Counters in Bit-Parallel String Matching
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism. The recently presented technique of nested counters (Matryoshka counters) [1] is to handle small counters most of the time, and refer to larger counters periodically, when the small counters may get full, to prevent ...
متن کاملW-Period Technique for Parallel String Matching
In this paper, we present new approach for parallel string matching. Some known parallel string matching algorithms are considered based on duels by witness which focuses on the strengths and weaknesses of the currently known methods. This has applications such as string databases, Information Retrieval and computational biology. The new ‘divide and conquer’ approach has been introduced for par...
متن کاملParallel Algorithms for String Matching Problem Baesd on Butterfly Model
The string matching problem is one of the most studied problems in computer science. While it is very easily stated and many of the simple algorithms perform very well in practice, numerous works have been published on the subject and research is still very active. In this paper we propose a butterfly parallel computing model for parallel string matching. Experimental results show that, on a mu...
متن کاملA Practical Distributed String Matching Algorithm Architecture and Implementation
Traditional parallel single string matching algorithms are always based on PRAM computation model. Those algorithms concentrate on the cost optimal design and the theoretical speed. Based on the distributed string matching algorithm proposed by CHEN, a practical distributed string matching algorithm architecture is proposed in this paper. And also an improved single string matching algorithm ba...
متن کاملPrivacy-preserving String-Matching With PRAM Algorithms
In this report, we investigate the applicability of algorithms designed for parallel computers (PRAM) to build efficient computations in a secure multi-party (SMC) computation setting based on secret sharing. As an example, we have chosen to implement string-matching algorithms to assess the efficiency and possible gains of parallel algorithm design paradigms in SMC. The use of parallel algorit...
متن کامل